Embedding the n-cube in Lower Dimensions
نویسندگان
چکیده
منابع مشابه
An Optimizing Method for Embedding Linear Graphs in N-Cube
In this paper a method of embedding a linear graph in n-cube is discussed. Necessary and sufficient conditions on node configurations for the embeddability are obtained by analyzing the structure of n-cube in code space with respect to the distance 2c by means of Reed-Muller code. The fundamental idea in this study is to modify a given graph iteratively in such a manner that the connecting prop...
متن کاملLower bounds for the simplexity of the n-cube
In this paper we prove a new asymptotic lower bound for theminimal number of simplices in simplicial dissections of n-dimensional cubes. In particular we show that the number of simplices in dissections of n-cubes without additional vertices is at least (n + 1) n−1 2 . © 2012 Elsevier B.V. All rights reserved.
متن کاملEmbedding of Fault-Tolerant Trees in the Josephus Cube
The tree interconnection network lends itself to several suitably structured applications. However, the low connectivity at each node, traffic congestion and single point of failure at the root node reduce reliability and availability. Both the hypertree and X-tree are faulttolerant variants of the basic tree network and have been the focus of more recent implementation and research interest. I...
متن کاملDerangements on the n-cube
Chen, W.Y.C. and R.P. Stanley, Derangements on the n-cube, Discrete Mathematics 115 (1993) 65-15. Let Q. be the n-dimensional cube represented by a graph whose vertices are sequences of O’s and l’s of length n, where two vertices are adjacent if and only if they differ only at one position. A k-dimensional subcube or a k-face of Q. is a subgraph of Q. spanned by all the vertices u1 u2 u, with c...
متن کاملAutomorphisms of the Cube n
Consider a hypergraph H n where the vertices are points of the d-dimensional combinatorial cube n and the edges are all sets of n points such that they are in one line. We study the structure of the group of automorphisms of H n, i.e., permutations of points of n d preserving the edges. In this paper we provide a complete characterization. Moreover, we consider the Colored Cube Isomorphism prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1986
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(86)80026-9